Square smoothing regularization matrices with accurate boundary conditions
نویسندگان
چکیده
This paper is concerned with the solution of large-scale linear discrete ill-posed problems. The determination of a meaningful approximate solution of these problems requires regularization. We discuss regularization by the Tikhonov method and by truncated iteration. The choice of regularization matrix in Tikhonov regularization may significantly affect the quality of the computed approximate solution. The present paper describes the construction of square regularization matrices from finite difference equations with a focus on the boundary conditions. The regularization matrices considered have a structure that makes them easy to apply in iterative methods, including methods based on the Arnoldi process. Numerical examples illustrate the properties and effectiveness of the regularization matrices described.
منابع مشابه
Simple Square Smoothing Regularization Operators
Tikhonov regularization of linear discrete ill-posed problems often is applied with a finite difference regularization operator that approximates a low-order derivative. These operators generally are represented by banded rectangular matrices with fewer rows than columns. They therefore cannot be applied in iterative methods that are based on the Arnoldi process, which requires the regularizati...
متن کاملFast transforms for high order boundary conditions
We study strategies for increasing the precision in the blurring models by maintaining a complexity in the related numerical linear algebra procedures (matrixvector product, linear system solution, computation of eigenvalues etc.) of the same order of the celebrated Fast Fourier Transform. The key idea is the choice of a suitable functional basis for representing signals and images. Starting fr...
متن کاملAdaptive Finite Element and Local Regularization Methods for the Inverse ECG Problem
One of the fundamental problems in theoretical electrocardiography can be characterized by an inverse problem. We present new methods for achieving better estimates of heart surface potential distributions in terms of torso potentials through an inverse procedure. First, we outline an automatic adaptive refinement algorithm that minimizes the spatial discretization error in the transfer matrix ...
متن کاملFast Computation of Moore-Penrose Inverse Matrices
Many neural learning algorithms require to solve large least square systems in order to obtain synaptic weights. Moore-Penrose inverse matrices allow for solving such systems, even with rank deficiency, and they provide minimum-norm vectors of synaptic weights, which contribute to the regularization of the input-output mapping. It is thus of interest to develop fast and accurate algorithms for ...
متن کاملDeriving boundary S matrices
We show how to derive exact boundary S matrices for integrable quantum field theories in 1+1 dimensions using lattice regularization. We do this calculation explicitly for the sine-Gordon model with fixed boundary conditions using the Bethe ansatz for an XXZtype spin chain in a boundary magnetic field. Our results agree with recent conjectures of Ghoshal and Zamolodchikov, and indicate that the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Computational Applied Mathematics
دوره 272 شماره
صفحات -
تاریخ انتشار 2014